/ leetcodesolve / 209. Minimum Size Subarray Sum Medium.py
swadhin biswas More codes · 6/23/2025
ed4e897
11 lines · 351 Bytes
1
2
3
4
5
6
7
8
9
10
11
class Solution:
    def minSubArrayLen(self, target: int, nums: List[int]) -> int:
       right,sumof,index=0,0,float('inf')
       for left in range(len(nums)):
        sumof+=nums[left]
        while sumof>=target:
          index=min(index,left-right+1)
          s-=nums[right]
          right+=1
       return 0 if index==float('inf') else index